Approximating real functions which possess nth derivatives of bounded variation and applications
نویسنده
چکیده
The main aim of this paper is to provide an approximation for the function f which possesses continuous derivatives up to the order n−1 (n ≥ 1) and has the n−th derivative of bounded variation, in terms of the chord that connects its end points A = (a, f (a)) and B = (b, f (b)) and some more terms which depend on the values of the k derivatives of the function taken at the end points a and b, where k is between 1 and n. Natural applications for some elementary functions such as the exponential and the logarithmic functions are given as well.
منابع مشابه
A companion of Ostrowski's inequality for functions of bounded variation and applications
A companion of Ostrowski's inequality for functions of bounded variation and applications are given.
متن کاملOn the generalization of Trapezoid Inequality for functions of two variables with bounded variation and applications
In this paper, a generalization of trapezoid inequality for functions of two independent variables with bounded variation and some applications are given.
متن کاملSome Perturbed Inequalities of Ostrowski Type for Functions whose n-th Derivatives Are Bounded
We firstly establish an identity for $n$ time differentiable mappings Then, a new inequality for $n$ times differentiable functions is deduced. Finally, some perturbed Ostrowski type inequalities for functions whose $n$th derivatives are of bounded variation are obtained.
متن کاملWhat is the complexity of Stieltjes integration ? Arthur
We study the complexity of approximating the Stieltjes integral R 1 0 f (x) dg(x) for functions f having r continuous derivatives and functions g whose sth derivative has bounded variation. Let r(n) denote the nth minimal error attainable by approximations using at most n evaluations of f and g, and let comp(") denote the "-complexity (the minimal cost of computing an "-approximation). We show ...
متن کاملWhat Is the Complexity of Stieltjes Integration?
We study the complexity of approximating the Stieltjes integral R 1 0 f (x)dg(x) for functions f having r continuous derivatives and functions g whose sth derivative has bounded variation. Let r(n) denote the nth minimal error attainable by approximations using at most n evaluations of f and g, and let comp(ε) denote the ε-complexity (the minimal cost of computing an ε-approximation). We show t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computers & Mathematics with Applications
دوره 56 شماره
صفحات -
تاریخ انتشار 2008